Restrained Revision
نویسندگان
چکیده
As part of the justification of their proposed framework for iterated belief revision Darwiche and Pearl advanced a convincing argument against Boutilier’s natural revision, and provided a prototypical revision operator which fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. These are characterised in terms of syntactic as well as semantic postulates. Admissible revision ensures that the penultimate input is not ignored completely, thereby eliminating natural revision, but includes the prototypical DarwichePearl operator, Nayak’s well-known lexicographic revision operator, and a newly introduced operator called restrained revision. We give a syntactic and a semantic characterisation of restrained revision, and demonstrate that it satisfies desirable properties. In particular, we show that it is the most conservative of admissible revision operators, while lexicographic revision is the least conservative. This makes an interesting comparison with the Darwiche-Pearl framework in which lexicographic revision is also the least conservative, but natural revision is the most conservative. In a sense, then, restrained revision can be seen as an appropriate replacement for natural revision. Finally we show that restrained revision can also be viewed as a composite operator, consisting of natural revision preceded by an application of a “backwards revision” operator previously studied by Papini.
منابع مشابه
Admissible and Restrained Revision
As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutilier’s natural revision and provided a prototypical revision operator that fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. Admissible revision ensures that ...
متن کاملRevision by History
This article proposes a solution to the problem of obtaining plausibility information, which is necessary to perform belief revision: given a sequence of revisions, together with their results, derive a possible initial order that has generated them; this is different from the usual assumption of starting from an all-equal initial order and modifying it by a sequence of revisions. Four semantic...
متن کامل$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملUltra-Low Cycle Fatigue Fracture Life of a Type of Buckling Restrained Brace
Buckling restrained braced frames (BRBFs) for seismic load resistance have been widely used in recent years. One of the key requirements for a buckling restrained brace is to sustain large plastic deformations under severe ground motions. The core of a buckling restrained brace is prone to fatigue fracture under cyclic loading. The earthquake induced fracture type of the core plate in a bucklin...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کامل